- automatic theorem prover
- программа (для) автоматического доказательства теорем
English-Russian dictionary of computer science and programming. 2013.
automatic theorem prover
Смотреть что такое "automatic theorem prover" в других словарях:
Vampire theorem prover — Vampire is an automatic theorem prover for first order classical logic developed in the Computer Science Department of the University of Manchester by Prof. Andrei Voronkov previously together with Dr. Alexandre Riazanov. It has won the world cup … Wikipedia
Isabelle (theorem prover) — Infobox Software name = Isabelle caption = collapsible = author = developer = released = latest release version = latest release date = latest maintenance version = latest maintenance date = latest preview version = latest preview date =… … Wikipedia
Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… … Wikipedia
Automated reasoning — is an area of computer science dedicated to understand different aspects of reasoning. The study in automated reasoning helps produce software which allows computers to reason completely, or nearly completely, automatically. Although automated… … Wikipedia
Presburger arithmetic — is the first order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who published it in 1929. It is not as powerful as Peano arithmetic because it omits multiplication.OverviewThe language of Presburger… … Wikipedia
Satisfiability Modulo Theories — (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first order logic with equality. Examples of theories typically used in computer science are the theory of real… … Wikipedia
Term indexing — In computer science, term indexing is the task of creating an index of terms and clauses in a collection.Many operations in automatic theorem provers require search in huge collections of terms and clauses. Such operations typically fall intothe… … Wikipedia
Relation algebra — is different from relational algebra, a framework developed by Edgar Codd in 1970 for relational databases. In mathematics, a relation algebra is a residuated Boolean algebra supporting an involutary unary operation called converse. The… … Wikipedia
Boyer-Moore-Algorithmus — Der Boyer Moore Algorithmus ist ein String Matching Algorithmus. Der Algorithmus wird dazu genutzt, um in einem Text T einen bestimmten Teiltext (Muster M) zu finden und wurde 1977 von Robert S. Boyer und J Strother Moore entwickelt.… … Deutsch Wikipedia
Nqthm — is a theorem prover sometimes referred to as the Boyer–Moore theorem prover. It was a precursor to ACL2.[1] Contents 1 History 2 Definitions 3 Theorem formulation … Wikipedia
Concolic testing — (a portmanteau of concrete and symbolic) is a hybrid software verification technique that interleaves concrete execution (testing on particular inputs) with symbolic execution, a classical technique that treats program variables as symbolic… … Wikipedia
